package leetcode.code1036;

import java.util.HashMap;
import java.util.Map;
import java.util.TreeSet;

import leetcode.IDebug;

public class Solution2 implements IDebug {

	int START = 0;

	public boolean isEscapePossible(int[][] blocked, int[] source, int[] target) {
		TreeSet<Integer> rows = new TreeSet<>();
		TreeSet<Integer> cols = new TreeSet<>();
		for (int[] block : blocked) {
			rows.add(block[0]);
			rows.add(block[1]);
		}
		rows.add(source[0]);
		rows.add(target[0]);
		cols.add(source[1]);
		cols.add(target[1]);
		int last = rows.first();
		int idr = last == 0 ? 0 : 1;
		Map<Integer, Integer> hashRows = new HashMap<>();
		Integer[] row = rows.toArray(new Integer[rows.size()]);

		return false;
	}

	@Override
	public void debug1() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug2() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}
